Role of Iso-connectivity Topologies in Multi-agent Interactions
نویسندگان
چکیده
In this paper, we present the benefits of exploring different topologies with equal connectivity measure, or iso-connectivity topologies, in relation to the multiagent system dynamics. The level of global information sharing ability among agents in a multi-agent network can be quantified by a connectivity measure, called as the Algebraic Connectivity of the associated graph consisting of point-mass agents as nodes and inter-connection links between them as edges. Distinct topologies with the same connectivity play profound role in multi-agent dynamics as they offer various ways to reorganize agents locations according to the requirement during a cooperative mission, without sacrificing the information exchange capability of the entire network. Determination of the distinct multi-agent graphs with identical connectivity is a multimodal problem, in other words, there exist multiple graphs that share the same connectivity. We present analytical solutions of determining distinct graphs with identical connectivity. A family of isospectral graphs are found out by utilizing an appropriate similarity transformation. Moreover, a zone of no connectivity change in a dense graph is unraveled where an agent can move freely without causing any change in the global connectivity. The proposed solutions are validated with the help of sufficient examples.
منابع مشابه
Accomplishing, Reasoning and Improvement of Vendor Reliant and Self Reliant Second Layer Network Topology Exploration
Agent network topology is one of the fundamental issues in the multi-agent area. Different from existing network topological theory, such as LAN or distributed system networks, agent network topology emphasizes communications and transactions between agents. Mobility and intelligence issues are major concerns in agent network topologies and these have not received much attention. In this paper,...
متن کاملOn Communication Requirements for Multi-agent Consensus Seeking
Several consensus protocols have been proposed in the literature and their convergence properties studied via a variety of methods. In all these methods, the communication topologies play a key role in the convergence of consensus processes. The goal of this paper is two fold. First, we explore communication topologies, as implied by the communication assumptions, that lead to consensus among a...
متن کاملDistributed Subgradient Algorithm for Multi-agent Convex Optimization with Local Constraint Sets
This paper considers a distributed constrained optimization problem, where the objective function is the sum of local objective functions of distributed nodes in a network. The estimate of each agent is restricted to different convex sets. To solve this optimization problem which is not necessarily smooth, we study a novel distributed projected subgradient algorithm for multi-agent optimization...
متن کاملMulti-agent Systems Reaching Optimal Consensus with Time-varying Communication Graphs ⋆
In this paper, an optimal consensus problem for continuous-time multi-agent systems is formulated and solved with time-varying interconnection topologies. Based on a sharp connectivity assumption, the considered multi-agent network with simple nonlinear distributed control rules achieves not only a consensus, but also an optimal one by agreeing within the global optimal solution set of a sum of...
متن کاملOn constructing Lyapunov functions for multi-agent systems
Lyapunov equations that dependon communication graph topologies provide building blocks of Lyapunov functions, which play an important role in controller design and stability analysis of multi-agent systems. However, construction of such a Lyapunov equation in some published works has a flaw or requires unnecessarily strong graph conditions. This paper presents several choices of Lyapunov equat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.03641 شماره
صفحات -
تاریخ انتشار 2016